%------------------------------------------------------------------------------
% File     : Duper---1.0
% Problem  : PUZ136^1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : duper %s

% Computer : n032.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 13:14:51 EDT 2023

% Result   : Theorem 7.26s 7.48s
% Output   : Proof 7.26s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : PUZ136^1 : TPTP v8.1.2. Released v5.2.0.
% 0.00/0.11  % Command    : duper %s
% 0.09/0.30  % Computer : n032.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit   : 300
% 0.09/0.30  % WCLimit    : 300
% 0.09/0.30  % DateTime   : Sat Aug 26 22:13:14 EDT 2023
% 0.09/0.31  % CPUTime    : 
% 7.26/7.48  SZS status Theorem for theBenchmark.p
% 7.26/7.48  SZS output start Proof for theBenchmark.p
% 7.26/7.48  Clause #0 (by assumption #[]): Eq (parent kronus zeus) True
% 7.26/7.48  Clause #1 (by assumption #[]): Eq (Not (parent sutekh horus)) True
% 7.26/7.48  Clause #2 (by assumption #[]): Eq (Not (Exists fun P => Exists fun X => Exists fun Y => And (P X) (Not (P Y)))) True
% 7.26/7.48  Clause #3 (by clausification #[1]): Eq (parent sutekh horus) False
% 7.26/7.48  Clause #4 (by clausification #[2]): Eq (Exists fun P => Exists fun X => Exists fun Y => And (P X) (Not (P Y))) False
% 7.26/7.48  Clause #5 (by clausification #[4]): ∀ (a : Iota → Prop), Eq (Exists fun X => Exists fun Y => And (a X) (Not (a Y))) False
% 7.26/7.48  Clause #6 (by clausification #[5]): ∀ (a : Iota → Prop) (a_1 : Iota), Eq (Exists fun Y => And (a a_1) (Not (a Y))) False
% 7.26/7.48  Clause #7 (by clausification #[6]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Eq (And (a a_1) (Not (a a_2))) False
% 7.26/7.48  Clause #8 (by clausification #[7]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a a_1) False) (Eq (Not (a a_2)) False)
% 7.26/7.48  Clause #9 (by clausification #[8]): ∀ (a : Iota → Prop) (a_1 a_2 : Iota), Or (Eq (a a_1) False) (Eq (a a_2) True)
% 7.26/7.48  Clause #15 (by fluidSup #[9, 0]): ∀ (a : Iota → Prop) (a_1 : Prop → Iota) (a_2 : Iota), Or (Eq (a (a_1 True)) False) (Eq (a a_2) True)
% 7.26/7.48  Clause #19 (by superposition #[9, 0]): ∀ (a : Iota), Or (Eq ((fun x => parent kronus x) a) True) (Eq False True)
% 7.26/7.48  Clause #28 (by betaEtaReduce #[19]): ∀ (a : Iota), Or (Eq (parent kronus a) True) (Eq False True)
% 7.26/7.48  Clause #29 (by clausification #[28]): ∀ (a : Iota), Eq (parent kronus a) True
% 7.26/7.48  Clause #31 (by fluidSup #[29, 15]): ∀ (a : Iota → Iota) (a_1 : Iota), Or (Eq ((fun _ => _) True) False) (Eq ((fun x => parent x (a x)) a_1) True)
% 7.26/7.48  Clause #677 (by betaEtaReduce #[31]): ∀ (a : Iota) (a_1 : Iota → Iota), Or (Eq True False) (Eq (parent a (a_1 a)) True)
% 7.26/7.48  Clause #678 (by clausification #[677]): ∀ (a : Iota) (a_1 : Iota → Iota), Eq (parent a (a_1 a)) True
% 7.26/7.48  Clause #679 (by superposition #[678, 3]): Eq True False
% 7.26/7.48  Clause #774 (by clausification #[679]): False
% 7.26/7.48  SZS output end Proof for theBenchmark.p
%------------------------------------------------------------------------------